Index Appearance Record for Transforming Rabin Automata into Parity Automata
نویسندگان
چکیده
Transforming deterministic ω-automata into deterministic parity automata is traditionally done using variants of appearance records. We present a more efficient variant of this approach, tailored to Rabin automata, and several optimizations applicable to all appearance records. We compare the methods experimentally and find out that our method produces smaller automata than previous approaches. Moreover, the experiments demonstrate the potential of our method for LTL synthesis, using LTL-to-Rabin translators. It leads to significantly smaller parity automata when compared to state-of-the-art approaches on complex formulae.
منابع مشابه
Buchi Determinization Made Tighter
By separating the principal acceptance mechanism from the concrete acceptance condition of a given Büchi automaton with n states, Schewe presented the construction of an equivalent deterministic Rabin transition automaton with o((1.65n)n) states via history trees, which can be simply translated to a standard Rabin automaton with o((2.26n)n) states. Apart from the inherent simplicity, Schewe’s c...
متن کاملDeterminization of $\omega$-automata unified
We present a uniform construction for converting ω-automata with arbitrary acceptance conditions to equivalent deterministic parity automata (DPW). Given a non-deterministic automaton with n states, our construction gives a DPW with at most 2 2 logn) states and O(n) parity indices. The corresponding bounds when the original automaton is deterministic are O(n!) and O(n), respectively. Our algori...
متن کاملDeterminising Parity Automata
Parity word automata and their determinisation play an important role in automata and game theory. We discuss a determinisation procedure for nondeterministic parity automata through deterministic Rabin to deterministic parity automata. We prove that the intermediate determinisation to Rabin automata is optimal. We show that the resulting determinisation to parity automata is optimal up to a sm...
متن کاملStrategy Construction in Infinite Ganes with Streett and Rabin Chain Winning Conditions
We consider nite-state games as a model of nonterminating reactive computations. A natural type of speciication is given by games with Streett winning condition (corresponding to automata accepting by conjunctions of fairness conditions). We present an algorithm which solves the problem of program synthesis for these speciications. We proceed in two steps: First, we give a reduction of Streett ...
متن کاملThe Non-deterministic Mostowski Hierarchy and Distance-Parity Automata
Given a Rabin tree-language and natural numbers i, j, the language is said to be i, j-feasible if it is accepted by a parity automaton using priorities {i, i+1, ..., j}. The i, j-feasibility induces a hierarchy over the Rabin-tree languages called the Mostowski hierarchy. In this paper we prove that the problem of deciding if a language is i, j-feasible is reducible to the uniform universality ...
متن کامل